A hybrid neural network approach to bilevel programming problems
نویسندگان
چکیده
منابع مشابه
A hybrid neural network approach to bilevel programming problems
A combined neural network and tabu search hybrid algorithm is proposed for solving the bilevel programming problem. To illustrate the approach, two numerical examples are solved and the results are compared with those in the literature. c © 2006 Elsevier Ltd. All rights reserved.
متن کاملA Neural Network Approach for Solving Linear Bilevel Programming Problem
A neural network model is presented for solving nonlinear bilevel programming problem, which is a NP-hard problem. The proposed neural network is proved to be Lyapunov stable and capable of generating approximal optimal solution to the nonlinear bilevel programming problem. The asymptotic properties of the neural network are analyzed and the condition for asymptotic stability, solution feasibil...
متن کاملA Neural Network Approach for Nonlinear Bilevel Programming Problem
A novel neural network approach is presented for solving nonlinear bilevel programming problem. The proposed neural network is proved to be Lyapunov stable and capable of generating optimal solution to the nonlinear bilevel programming problem. The asymptotic properties of the neural network are analyzed and the condition for asymptotic stability, solution feasibility and solution optimality ar...
متن کاملA goal programming approach for multiobjective linear bilevel programming problems
ABSTRACT: Feasible solutions of Bilevel programming (BLP) problem have to satisfy the optimality conditions of a lower level optimization problem which is defined as part of its constraints. Multiobjective BLP (MOBLP) problems are the special case of BLP problems with multiple objectives at the upper level which require every feasible solution to satisfy the Pareto optimality conditions of a lo...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2007
ISSN: 0893-9659
DOI: 10.1016/j.aml.2006.07.013